Non-nequilibrium model on Apollonian networks

نویسندگان

  • F. W. S. Lima
  • André A. Moreira
  • Ascânio D. Araújo
چکیده

We investigate the majority-vote model with two states (-1,+1) and a noise parameter q on Apollonian networks. The main result found here is the presence of the phase transition as a function of the noise parameter q. Previous results on the Ising model in Apollonian networks have reported no presence of a phase transition. We also studied the effect of redirecting a fraction p of the links of the network. By means of Monte Carlo simulations, we obtained the exponent ratio γ/ν, β/ν, and 1/ν for several values of rewiring probability p. The critical noise q{c} and U were also calculated. Therefore, the results presented here demonstrate that the majority-vote model belongs to a different universality class than equilibrium Ising model on Apollonian network.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Phase Transitions in Equilibrium and Non-Equilibrium Models on Some Topologies

On some regular and non-regular topologies, we studied the critical properties of models that present up-down symmetry, like the equilibrium Ising model and the nonequilibrium majority vote model. These are investigated on networks, like Apollonian (AN), Barabási–Albert (BA), small-worlds (SW), Voronoi–Delaunay (VD) and Erdös–Rényi (ER) random graphs. The review here is on phase transitions, cr...

متن کامل

Tax Evasion Dynamics via Non-Equilibrium Model on Complex Networks

The Zaklan model has become an excellent mechanism to control the tax evasion fluctuations (TEF) in a peopleor agent-based community. Initially, the equilibrium Ising model (IM) had been used as a dynamic of temporal evolution of the Zaklan model near the critical point of the IM. On some complex network the IM presents no critical points or well-defined phase transitions. Then, through Monte C...

متن کامل

. so c - ph ] 3 1 O ct 2 00 6 Vertex labeling and routing in expanded Apollonian networks

We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their vertices that allows to determine a shortest path routing between any two vertices of the network based only on the labels.

متن کامل

Strong geodetic problem in networks: computational complexity and solution for Apollonian networks

The geodetic problem was introduced by Harary et al. [17]. In order to model some social network problems, a similar problem is introduced in this paper and named the strong geodetic problem. The problem is solved for complete Apollonian networks. It is also proved that in general the strong geodetic problem is NP-complete.

متن کامل

High dimensional Apollonian networks

We propose a simple algorithm which produces high dimensional Apollonian networks with both small-world and scale-free characteristics. We derive analytical expressions for the degree distribution, the clustering coefficient and the diameter of the networks, which are determined by their dimension. PACS numbers: 89.75.Hc, 89.75.Da, 89.20.Hh High dimensional Apollonian networks 2

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 86 5 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2012